integer factorization中文什么意思

整数分解

质因数分解

• integer:    n. 1.【数学】整数 (opp. ...
• integer factorization problem, ifp:    整数分解难题
• factorization:    分解为因子; 因式分解; 因数分解; ...

例句与用法

更多例句：  下一页

1. Information technology - security techniques - digital signature schemes giving message recovery - integer factorization based mechanisms
   信息技术.安全技术.使电文恢复的数字签名方案.基于整数因子分解的机制
2. Information technology - security techniques - digital signature schemes giving message recovery part 2 : integer factorization based mechanisms
   信息技术.保密技术.具有信息恢复功能的数字签名方案.第2部分:基于整数因子分解的机构
3. Chun - chih peng and chung - huang yang , " design and implementation for integer factorization and primality testing tools with elliptic curve on windows platforms , " 2007 symposium on cryptography and information security , sasebo , japan , january 2007
   张家瀚、杨中皇，支援链结机制之标准化时戳实作， 2007知识社群与资讯安全研讨会，文化大学， 2007年5月。
4. Using the idea of secret - sharing and signature - of - knowledge , a new perfect and strong key - insulated signature scheme based on the assumption of integer factorization problem is proposed . the scheme has a low computation in key updating and signing , thus fitting for the mobile devices
   ( 6 )对签名系统中的密钥泄露问题进行了研究，在分析相关技术的基础上，利用秘密分享和知识签名，给出了一个完善的强key - insulated签名方案。
5. The elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ) . it was accepted in 1999 as an ansi standard , and was accepted in 2000 as ieee and nist standards . unlike the ordinary discrete logarithm problem and the integer factorization problem , no subexponential - time is known for the elliptic curve discrete logarithm problem . for this reason , the strength - per - key - bit is substantially greater in an algorithm that uses elliptic curves
   椭圆曲线数字签名算法（ ecdsa ）是数字签名算法（ dsa ）的椭圆曲线对等。它先后成为ansi ， ieee ， nist和iso的标准，而且其它的一些组织正在考虑成为其标准。不象普通的离散对数问题和因数分解问题，椭圆曲线离散对数问题没有已知的亚指数算法，所以使用椭圆曲线的算法在密钥的位强度是足够高的。

百科释义

In number theory, integer factorization or prime factorization is the decomposition of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer.